(n,1,1,α)-Center Problem

Authors

A. Mohades Associate Professor, Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran

M. Eskandari Assistant Professor, Department of Mathematics, Alzahra University, Tehran, Iran

P. Kavand PhD. Student of Computer Science, Department of Mathematics and Computer Science, Amirkabir University of Technology, Tehran, Iran.

Abstract:

Given a set of points in the plane and a constant ,-center problem is to find two closed disks which each covers the whole , the diameter of the bigger one is minimized, and the distance of the two centers is at least . Constrained -center problem is the -center problem in which the centers are forced to lie on a given line . In this paper, we first introduce -center problem and its constrained version. Then, we present an algorithm for solving the -center problem. Finally, we propose a linear time algorithm for its constrained version.

Upgrade to premium to download articles

Already have an account?login

similar resources

Classical Center Location Problem Under Uncertain Environment

This paper investigates the $p$-center location problem on a network in which vertex weights and distances between vertices are uncertain. The concepts of the $alpha$-$p$-center and the expected $p$-center are introduced. It is shown that the $alpha$-$p$-center and the expected $p$-center models can be transformed into corresponding deterministic models. Finally, linear time algorithms for find...

full text

Unweighted p-center problem on extended stars

An extended star is a tree which has only one vertex with degree larger than two. The -center problem in a graph asks to find a subset of the vertices of of cardinality such that the maximum weighted distances from to all vertices is minimized. In this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.

full text

The P-Center Problem under Uncertainty

Facility location decisions play a prominent role in strategic planning of many firms, companies and governmental organizations. Since in many real-world facility location problems, the data are subject to uncertainty, in this paper, we consider the P-center problem under uncertainty of demands. Using Bertsimas and Sim approach, we develop a robust model of the problem as an integer programming...

full text

Uncapacitated phub center problem under uncertainty

Hubs are facilities to collect arrange and distribute commodities in telecommunication networks, cargo delivery systems, etc. In this paper, an uncapacitated phub center problem in case of single allocation and also multiple allocation will be introduced in which travel times or transportation costs are considered as fuzzy parameters. Then, by proposing new methods, the presented problem is con...

full text

The P-Center Problem under Uncertainty

full text

Cyclicity versus Center Problem

We prove that there are one-parameter families of planar differential equations for which the center problem has a trivial solution and on the other hand the cyclicity of the weak focus is arbitrarily high. We illustrate this phenomenon in several examples for which this cyclicity is computed.

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}

Journal title

International Journal of Modeling, Identification, Simulation and Control

volume 46 issue 1

pages 57- 64

publication date 2014-05-22

unfollow

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

computational geometry K-Center Problem Farthest Point Voronoi Diagram Center Hull

Hosted on Doprax cloud platform doprax.com